Historical Graph Management in Dynamic Environments
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولDynamic graph-based search in unknown environments
A novel graph-based approach to search within unknown environments is presented. A virtual geometric structure is imposed upon the environment represented in memory by a graph. Algorithms use this representation to coordinate a team of robots (or entities). Local discovery of environment features causes dynamic expansion of the graph resulting in global exploration of the unknown environment. T...
متن کاملProactive workload management in dynamic virtualized environments
a r t i c l e i n f o a b s t r a c t Recently, with the improvement of Cloud systems technologies and the essential advantages they can provide such as availability, scalability, and costs saving; massive domains in the IT industry are directing their business to the Cloud. To fit the computing demands of this trend along with nowadays fluky applications (e.g. social networks, media contents),...
متن کاملDynamic SLAs management in service oriented environments
The increasing adoption of service oriented architectures across different administrative domains, forces service providers to use effective mechanisms and strategies of resource management in order for them to be able to guarantee the quality levels their customers demands during service provisioning. Service level agreements (SLA) are the most common mechanism used to establish agreements on ...
متن کامل1.1 Distributed Knowledge Management in Dynamic Environments
1.1.1Introduction Logistic processes are inherently dynamic and hence require the ability to plan and re-plan in complex situations, under rigid time constraints, and in light of uncertain, incomplete, and false information. Standard scenarios of logistic processes typically have been modeled on the basis of static graph-theoretic representations. The well-known traveling salesman problem (TSP)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2020
ISSN: 2079-9292
DOI: 10.3390/electronics9060895